Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
311	Finding Hamiltonian Paths in Tournaments on Clusters - A Provably Communication-Efficient Approach Chun-Hsi Huang Xin He Add to Reading List Source URL: www.cse.uconn.edu Language: English - Date: 2004-02-16 16:47:53 Computational complexity theory Message Passing Interface Speedup Algorithm Hamiltonian path Time complexity Bulk synchronous parallel Parallel algorithm Parallel Random Access Machine Theoretical computer science Parallel computing Computing
312	A Stability-based Validation Procedure for Differentially Private Machine Learning Kamalika Chaudhuri Department of Computer Science and Engineering UC San Diego, La Jolla CA 92093 Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2014-01-05 20:06:51 Applied mathematics Machine learning Differential privacy Exponential mechanism Stability Cross-validation Support vector machine Algorithm Time complexity Data privacy Theoretical computer science Statistics
313	Computing Low Latency Batches with Unreliable Workers in Volunteer Computing Environments Eric M. Heien, Noriyuki Fujimoto, Kenichi Hagihara Graduate School of Information Science and Technology, Osaka University Toyonak Add to Reading List Source URL: www.heien.org Language: English - Date: 2011-02-16 09:55:36 Mathematics Analysis of algorithms Distributed computing Algorithm Scheduling Randomized algorithm Computational complexity theory Time complexity Theoretical computer science Applied mathematics Scheduling algorithms
314	Zeszyty Naukowe WWSI, No. 11, Vol. 8, 2014, ppAlgorithms Using List Scheduling and Greedy Strategies for Scheduling in the Flowshop with Resource Constraints Ewa Figielska* Warsaw School of Computer Science Add to Reading List Source URL: zeszyty-naukowe.wwsi.edu.pl Language: English - Date: 2014-12-23 06:32:27 Mathematics Mathematical optimization Scheduling Job shop scheduling Analysis of algorithms Algorithm Parallel computing Time complexity Shifting bottleneck heuristic Applied mathematics Operations research Theoretical computer science
315	Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast Shlomi Dolev1 , Seth Gilbert2 , Majid Khabbazian3 , and Calvin Newport4 ? 1 Ben-Gurion University, Beersheba, Israel Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2011-11-17 23:45:03 Analysis of algorithms Information theory Probabilistic complexity theory Randomized algorithm Algorithm SL Time complexity Channel Theoretical computer science Computational complexity theory Applied mathematics
316	All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns Ron Adany1 , Moran Feldman2 , Elad Haramaty2 , Rohit Khandekar3 , Baruch Schieber4 , Roy Schwartz5 , Hadas Shachnai2 , and Tami T Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-01-05 09:50:09 Complexity classes Approximation algorithms NP-complete problems Matroid theory Generalized assignment problem Knapsack problem Submodular set function APX Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
317	Faster Construction of Planar Two-centers David Eppstein∗ Abstract tical implementation. The method is complicated, and Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 1997-12-08 20:38:05 Analysis of algorithms Computational geometry Probabilistic complexity theory Randomized algorithm Algorithm Time complexity Binary search algorithm LP-type problem Closest pair of points problem Theoretical computer science Applied mathematics Mathematics
318	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics S¨oren Laue∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:24:48 Operations research Spanning tree Complexity classes NP-complete problems Minimum spanning tree Steiner tree problem R-tree Approximation algorithm Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
319	A S IM PL E A L GO RI T H M FO R I DE N T IFY I N G AB B R EV I A TI O N DE FI N I TI O N S IN B IO M EDI CA L T E X T A R I E L S . S C H W A R TZ M AR TI A . H E A R S T Add to Reading List Source URL: bailando.sims.berkeley.edu Language: English - Date: 2002-09-25 14:53:58 Pattern matching Analysis of algorithms Algorithm Mathematical logic Natural language processing Recall Regular expression Time complexity Theoretical computer science Applied mathematics Computer science
320	Succinct Randomized Encodings and their Applications∗ Nir Bitansky† Sanjam Garg‡ Huijia Lin§ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-21 11:01:51 Complexity classes EXPTIME P/poly Time complexity PP NL P NC Theoretical computer science Computational complexity theory Applied mathematics

UPDATE